Asymptotic estimates on finite Abelian groups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On non-normal non-abelian subgroups of finite groups

‎In this paper we prove that a finite group $G$ having at most three‎ ‎conjugacy classes of non-normal non-abelian proper subgroups is‎ ‎always solvable except for $Gcong{rm{A_5}}$‎, ‎which extends Theorem 3.3‎ ‎in [Some sufficient conditions on the number of‎ ‎non-abelian subgroups of a finite group to be solvable‎, ‎Acta Math‎. ‎Sinica (English Series) 27 (2011) 891--896.]‎. ‎Moreover‎, ‎we s...

متن کامل

On $m^{th}$-autocommutator subgroup of finite abelian groups

Let $G$ be a group and $Aut(G)$ be the group of automorphisms of‎ ‎$G$‎. ‎For any natural‎ number $m$‎, ‎the $m^{th}$-autocommutator subgroup of $G$ is defined‎ ‎as‎: ‎$$K_{m} (G)=langle[g,alpha_{1},ldots,alpha_{m}] |gin G‎,‎alpha_{1},ldots,alpha_{m}in Aut(G)rangle.$$‎ ‎In this paper‎, ‎we obtain the $m^{th}$-autocommutator subgroup of‎ ‎all finite abelian groups‎.

متن کامل

On Asymptotic Dimension of Countable Abelian Groups

We compute the asymptotic dimension of the rationals given with an invariant proper metric. Also we show that a countable torsion abelian group taken with an invariant proper metric has asymptotic dimension zero.

متن کامل

on finite a-perfect abelian groups

‎let $g$ be a group and $a=aut(g)$ be the group of automorphisms of‎ ‎$g$‎. ‎then the element $[g,alpha]=g^{-1}alpha(g)$ is an‎ ‎autocommutator of $gin g$ and $alphain a$‎. ‎also‎, ‎the‎ autocommutator subgroup of g is defined to be‎ ‎$k(g)=langle[g,alpha]|gin g‎, ‎alphain arangle$‎, ‎which is a‎ ‎characteristic subgroup of $g$ containing the derived subgroup‎ ‎$g'$ of $g$‎. ‎a group is defined...

متن کامل

Decomposing finite Abelian groups

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Publications de l'Institut Mathematique

سال: 2003

ISSN: 0350-1302,1820-7405

DOI: 10.2298/pim0374057c